λμ-calculus and Λμ-calculus: a Capital Difference
نویسندگان
چکیده
Since Parigot designed the λμ-calculus to algorithmically interpret classical natural deduction, several variants of λμ-calculus have been proposed. Some of these variants derived from an alteration of the original syntax due to de Groote, leading in particular to the Λμ-calculus of the second author, a calculus truly different from λμ-calculus since, in the untyped case, it provides a Böhm separation theorem that the original calculus does not satisfy. In addition to a survey of some aspects of the history of λμ-calculus, we study connections between Parigot’s calculus and the modified syntax by means of an additional toplevel continuation. This analysis is twofold: first we relate λμ-calculus and Λμ-calculus in the typed case using λμtp-calculus, which contains a toplevel continuation constant tp, and then we use calculi of the family of λμt̂p-calculi, containing a toplevel continuation variable t̂p, to study the untyped setting and in particular relate calculi in the modified syntax.
منابع مشابه
Typing streams in the Λμ-calculus: extended abstract
Λμ-calculus [11] has been built as an untyped extension of the λμ-calculus [10] in order to recover Böhm theorem which was known to fail in λμ-calculus since a result by David & Py [2]. An essential computational feature of Λμ-calculus for separation to hold is the unrestricted use of abstractions over continuation variables that provides the calculus with a construction of streams. In [11], Λμ...
متن کاملStandardization and Böhm trees for Λμ-calculus
Λμ-calculus is an extension of Parigot's λμ-calculus which (i) satis es Separation theorem: it is Böhm-complete, (ii) corresponds to CBN delimited control and (iii) is provided with a stream interpretation. In the present paper, we study solvability and investigate Böhm trees for Λμ-calculus. Moreover, we make clear the connections between Λμcalculus and in nitary λ-calculi. After establishing ...
متن کاملOn the Computational Interpretation of Negation
We investigate the possibility of giving a computational interpretation of an involutive negation in classical natural deduction. We first show why this cannot be simply achieved by adding ¬¬A = A to typed λ-calculus: the main obstacle is that an involutive negation cannot be a particular case of implication at the computational level. It means that one has to go out typed λ-calculus in order t...
متن کاملThe differential λμ-calculus
We define a differential λμ-calculus which is an extension of both Parigot’s λμ-calculus and EhrhardRégnier’s differential λ-calculus. We prove some basic properties of the system: reduction enjoys ChurchRosser and simply typed terms are strongly normalizing.
متن کاملSeparation with streams in the Λμ-calculus
The λμ-calculus is an extension of the λ-calculus introduced in 1992 by Parigot [17] in order to generalize the Curry-Howard isomorphism to classical logic. Two versions of the calculus are usually considered in the literature: Parigot’s original syntax and an alternative syntax introduced by de Groote. In 2001, David and Py [5] proved that the Separation Property (also referred to as Böhm theo...
متن کامل